Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration
نویسندگان
چکیده
منابع مشابه
Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration
A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler’s generating function ∏∞ k=1 S(z k) for partitions, where S(z) = (1 − z)−1. By applying a method due to Khintchine, we extend Meinardus’ theorem to find the asymptotics...
متن کاملOn Meinardus' examples for the conjugate gradient method
The Conjugate Gradient (CG) method is widely used to solve a positive definite linear system Ax = b of order N . It is well-known that the relative residual of the kth approximate solution by CG (with the initial approximation x0 = 0) is bounded above by 2 h ∆κ + ∆ −k κ i−1 with ∆κ = √ κ + 1 √ κ− 1 , where κ ≡ κ(A) = ‖A‖2‖A−1‖2 is A’s spectral condition number. In 1963, Meinardus (Numer. Math.,...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولMeinardus’ theorem on weighted partitions: extensions and a probabilistic proof
The number cn of weighted partitions of an integer n, with parameters (weights) bk, k ≥ 1, is given by the generating function relationship ∑∞ n=0 cnz n = ∏∞ k=1(1− zk)−bk . Meinardus(1954) established his famous asymptotic formula for cn, as n → ∞, under three conditions on power and Dirichlet generating functions for the sequence bk. We give a probabilistic proof of Meinardus’ theorem with we...
متن کاملAsymptotic Enumeration Methods
12 Large singularities of analytic functions 113 12.1 The saddle point 13 Multivariate generating functions 128 14 Mellin and other integral transforms 134 15 Functional equations, recurrences, and combinations of methods 137 15.1 Implicit functions, graphical enumeration, and related
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/4581